Extended capabilities for visual cryptography
نویسندگان
چکیده
منابع مشابه
Extended capabilities for visual cryptography
An extended visual cryptography scheme, EVCS for short, for an access structure (? Qual ; ? Forb) on a set of n participants, is a technique to encode n images in such a way that when we stack together the transparencies associated to participants in any set X 2 ? Qual we get the secret message with no trace of the original images, but any X 2 ? Forb has no information on the shared image. More...
متن کاملNew Capabilities of Visual Cryptography
Visual cryptography schemes (VCS) consider the problem of encrypting and sharing images (printed text, hand written notes, pictures, etc.) in a perfectly secure way which can be decrypted directly by the human visual system. A k out of n VCS for is a technique by which a secret image (SI) is shared among n users called share-holders, when k or more users stack their shares (transparencies) toge...
متن کاملExtended Schemes for Visual Cryptography
An extended visual cryptography scheme, (? Qual ; ? Forb ; m)-EVCS for short, with pixel \expansion" m, for an access structure (? Qual ; ? Forb) on a set of n participants, is a technique to encode n innocent looking images in such a way that when we stack together the transparencies associated to participants in any set X 2 ? Qual we get the secret message with no trace of the original images...
متن کاملExtended visual cryptography schemes
Abstract. Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image to each member of a group P of n persons. Whereas most work in recent years has been done concerning the problem of qualified and forbidden subsets of P or the question of contrast optimizing, in this paper ...
متن کاملExtended visual cryptography systems
Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image to each member of a group P of n persons. Whereas most work in recent years has been done concerning the problem of qualified and forbidden subsets of P or the question of contrast optimizing, in this paper we study e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00127-9